Cross-Domain Association in Metacognitive Efficiency Depends on First-Order Task Types
نویسندگان
چکیده
منابع مشابه
Interval Efficiency Assessment in Network Structure Based on Cross –Efficiency
As we know, in evaluating of DMUs some of them might be efficient, so ranking of them have a high significant. One of the ranking methods is cross-efficiency. Cross efficiency evaluation in data envelopment analysis (DEA) is a commonly used skill for ranking decision making units (DMUs). Since, many studies ignore the intra-organizational communication and consider DMUs as a black box. For sign...
متن کاملEffects of age on metacognitive efficiency
Humans have a capacity to become aware of thoughts and behaviours known as metacognition. Metacognitive efficiency refers to the relationship between subjective reports and objective behaviour. Understanding how this efficiency changes as we age is important because poor metacognition can lead to negative consequences, such as believing one is a good driver despite a recent spate of accidents. ...
متن کاملOrder on Order Types
Given P and P ′, equally sized planar point sets in general position, we call a bijection from P to P ′ crossing-preserving if crossings of connecting segments in P are preserved in P ′ (extra crossings may occur in P ′). If such a mapping exists, we say that P ′ crossing-dominates P , and if such a mapping exists in both directions, P and P ′ are called crossing-equivalent. The relation is tra...
متن کاملa study on the effectiveness of task types (noticing-reformulation) on iranian low intermediate efl learners’ retention of collocations
چکیده پژوهش شبه تجربی حاضر به بررسی بکارگیری تمارین کلاسی که برانگیزنده آگاهی و توجه آگاهانه به همایندها بعنوان بخشی از یک دوره ی مکالمه زبان خارجی در یکی از آموزشگاه های زبان انگلیسی ایران است می پردازد.
First and Second Order Recursion on Abstract Data Types
This paper compares two scheme-based models of computation on abstract many-sorted algebras A: Feferman’s system ACP(A) of “abstract computational procedures” based on a least fixed point operator, and Tucker and Zucker’s system μPR(A) based on primitive recursion on the naturals together with a least number operator. We prove a conjecture of Feferman that (assuming A contains sorts for natural...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Frontiers in Psychology
سال: 2018
ISSN: 1664-1078
DOI: 10.3389/fpsyg.2018.02464